Mycielskian of graphs with small game domination number

Domination game is a played on finite, undirected graph G, between two players Dominator and Staller. During the game, alternately choose vertices of G such that each chosen vertex dominates at least one new not dominated by previously vertices. The aim to finish as early possible while Staller delay process much possible. domination number γg(G) total moves in when starts both play optimally. Similarly staller start γg′(G) Here Mycielskian studied. We establish bounds for terms its also number. with small are characterised.